منابع مشابه
Broadcast and Associative Operations on Fat-Trees
This paper analyzes the cost of performing broadcast, product and prefix computation on the ideal fat-tree, a model proposed here to capture distance and bandwidth properties common to a variety of fat-tree networks. Algorithms are developed and analyzed in terms of the capacity of channels at different levels of the fat-tree. Non trivial lower bounds are derived establishing the optimality of ...
متن کاملVisualising the Entirety of Broadcast Operations
Digital broadcast operations are becoming increasingly complex with more channels, associated “interactive” content and diverse delivery mechanisms. More channels demand more infrastructure. New control and automation tools can construct complex operational configurations. However, with ability to control comes the problem of understanding the configuration. Virtual environment technology can s...
متن کاملEnd to End Development Engineering
Raising software abstraction and re-use levels are key success factors for producing quality software products. Modeldriven architecture (MDA) is an OMG initiative following this trend by mapping a conceptual model of application specified in platform independent model (PIM), to one or more platform specific models (PSM) automatically. Because there is little previous work tackling the developm...
متن کاملFrom Analogue Broadcast Radio Towards End-to-End Communication
The capacity of the current ATC system is, among other factors, limited by the maximum number of aircraft that a controller can handle in a sector. This led in the past to a decrease of sector sizes in order to increase capacity. We study in this paper the impact of small sectors on the air-ground radio communication. Small sectors require a large number of radio channels, and the sector handov...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Institute of Television Engineers of Japan
سال: 1983
ISSN: 0386-6831,1884-9652
DOI: 10.3169/itej1978.37.566